Weak Theories of Operations and Types

نویسنده

Raymond Turner

چکیده

This is a survey paper on various weak systems of Feferman’s explicit mathematics and their proof theory. The strength of the systems considered in measured in terms of their provably terminating operations typically belonging to some natural classes of computational time or space complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elementary explicit types and polynomial time operations

This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polynomial time. The systems considered are natural extensions of the first-order applicative theories...

متن کامل

Modeling of the beam discontinuity with two analyses in strong and weak forms using a torsional spring model

In this paper, a discontinuity in beams whose intensity is adjusted by the spring stiffness factor is modeled using a torsional spring. Adapting two analyses in strong and weak forms for discontinuous beams, the improved governing differential equations and the modified stiffness matrix are derived respectively. In the strong form, two different solution methods have been presented to make an a...

متن کامل

Weak hyper semi-quantales and weak hypervalued topological spaces

The purpose of this paper is to construct a weak hyper semi-quantale as a generalization of the concept of semi-quantale and used it as an appropriate hyperlattice-theoretic basis to formulate new lattice-valued topological theories. Based on such weak hyper semi-quantale, we aim to construct the notion of a weak hypervalued-topology as a generalized form of the so-called lattice-valued t...

متن کامل

Choice and Uniformity in Weak Applicative Theories

We are concerned with first order theories of operations, based on combinatory logic and extended with the type W of binary words. The theories include forms of “positive” and “bounded” induction onW and naturally characterize primitive recursive and polytime functions (respectively). We prove that the recursive content of the theories under investigation (i.e. the associated class of provably ...

متن کامل